Synthetic Topologyof Data Types and Classical Spaces
نویسندگان
چکیده
منابع مشابه
Synthetic Topology: of Data Types and Classical Spaces
Synthetic topology as conceived in this monograph has three fundamental aspects: 1. to explain what has been done in classical topology in conceptual terms, 2. to provide one-line, enlightening proofs of the theorems that constitute the core of the theory, and 3. to smoothly export topological concepts and theorems to unintended situations, keeping the synthetic proofs unmodified. The unintende...
متن کاملBanach Spaces as Data Types
We introduce the operators modified limit and accumulation on a Banach space, and we use this to define what we mean by being internally computable over the space. We prove that any externally computable function from a computable metric space to a computable Banach space is internally computable. We motivate the need for internal concepts of computability by observing that the complexity of th...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولwavelets, modulation spaces and pseudidifferential operators
مبحث تحلیل زمان-فرکانسی سیگنالها یکی از مهمترین زمینه های مورد بررسی پژوهشگران علوم ÷ایه کاربردی و فنی مهندسی میباشد.در این پایان نامه فضاهای مدولاسیون به عنوان زمینه اصلی این بررسی ها معرفی گردیده اند و نتایج جدیدی که در حوزه های مختلف ریاضی،فیزیک و مهندسی کاربرداساسی و فراوانی دارند استوار و بیان شده اند.به ویژه در این پایان نامه به بررسی و یافتن مقادیر ویژه عملگر های شبه دیفرانسیل با سمبل در...
Classical isomorphisms of types
The study of isomorphisms of types has been mainly carried out in an intuitionistic setting. We extend some of these works to classical logic for both call-by-name and call-by-value computations by means of polarized linear logic and game semantics. This leads to equational characterizations of these isomorphisms for all the propositional connectives.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)05135-7